Solving dynamic stochastic economic models by mathematical programming decomposition methods.

Discrete-time optimal control problems arise naturally in many economic problems. Despite the rapid growth in computing power and new developments in the literature, many economic problems are still quite challenging to solve. Economists are aware of the limitations of some of these approaches for solving these problems due to memory and computational requirements. However, many of the economic models present some special structure that can be exploited in an efficient manner. This paper introduces a decomposition methodology, based on a mathematical programming framework, to compute the equilibrium path in dynamic models by breaking the problem into a set of smaller independent subproblems. We study the performance of the method solving a set of dynamic stochastic economic models. The numerical results reveal that the proposed methodology is efficient in terms of computing time and accuracyDynamic stochastic economic model; Computation of equilibrium; Mathematical programming; Decomposition techniques;

A decomposition procedure based on approximate newton directions

The efficient solution of large-scale linear and nonlinear optimization problems may require exploiting any special structure in them in an efficient manner. We describe and analyze some cases in which this special structure can be used with very little cost to obtain search directions from decomposed subproblems. We also study how to correct these directions using (decomposable) preconditioned conjugate gradient methods to ensure local convergence in all cases. The choice of appropriate preconditioners results in a natural manner from the structure in the problem. Finally, we conduct computational experiments to compare the resulting procedures with direct methods, as well as to study the impact of different preconditioner choices

LIBOR additive model calibration to swaptions markets

In the current paper, we introduce a new calibration methodology for the LIBOR market model driven by LIBOR additive processes based in an inverse problem. This problem can be splitted in the calibration of the continuous and discontinuous part, linking each part of the problem with at-the-money and in/out -of -the-money swaption volatilies. The continuous part is based on a semidefinite programming (convex) problem, with constraints in terms of variability or robustness, and the calibration of the Lévy measure is proposed to calibrate inverting the Fourier Transform

A vehicle routing model with split delivery and stop nodes

In this work, a new variant of the Capacitated Vehicle Routing Problem (CVRP) is presented where the vehicles cannot perform any route leg longer than a given length L (although the routes can be longer). Thus, once a route leg length is close to L, the vehicle must go to a stop node to end the leg or return to the depot. We introduce this condition in a variation of the CVRP, the Split Delivery Vehicle Routing Problem, where multiple visits to a customer by different vehicles are allowed. We present two formulations for this problem which we call Split Delivery Vehicle Routing Problem with Stop Nodes: a vehicle flow formulation and a commodity flow formulation. Because of the complexity of this problem, a heuristic approach is developed. We compare its performance with and without the stop nodesSplit delivery vehicle routing problem, Stop node, Granular neighborhood, Tabu search

Comparing univariate and multivariate models to forecast portfolio value-at-risk

This article addresses the problem of forecasting portfolio value-at-risk (VaR) with multivariate GARCH models vis-à-vis univariate models. Existing literature has tried to answer this question by analyzing only small portfolios and using a testing framework not appropriate for ranking VaR models. In this work we provide a more comprehensive look at the problem of portfolio VaR forecasting by using more appropriate statistical tests of comparative predictive ability. Moreover, we compare univariate vs. multivariate VaR models in the context of diversified portfolios containing a large number of assets and also provide evidence based on Monte Carlo experiments. We conclude that, if the sample size is moderately large, multivariate models outperform univariate counterparts on an out-of-sample basis.Market risk, Backtesting, Conditional predictive ability, GARCH, Volatility, Capital requirements, Basel II

LIBOR additive model calibration to swaptions markets

In the current paper, we introduce a new calibration methodology for the LIBOR market model driven by LIBOR additive processes based in an inverse problem. This problem can be splitted in the calibration of the continuous and discontinuous part, linking each part of the problem with at-the-money and in/out -of -the-money swaption volatilies. The continuous part is based on a semidefinite programming (convex) problem, with constraints in terms of variability or robustness, and the calibration of the Lévy measure is proposed to calibrate inverting the Fourier Transform.Lévy Market model, Calibration, Semidefinite programming

Calibration of shrinkage estimators for portfolio optimization

Shrinkage estimators is an area widely studied in statistics. In this paper, we contemplate the role of shrinkage estimators on the construction of the investor's portfolio. We study the performance of shrinking the sample moments to estimate portfolio weights as well as the performance of shrinking the naive sample portfolio weights themselves. We provide a theoretical and empirical analysis of different new methods to calibrate shrinkage estimators within portfolio optimizationPortfolio choice, Estimation error, Shrinkage estimators, Smoothed bootstrap

A decomposition procedure based on approximate Newton directions

The original publication is available at www.springerlink.comThe efficient solution of large-scale linear and nonlinear optimization problems may require exploiting any special structure in them in an efficient manner. We describe and analyze some cases in which this special structure can be used with very little cost to obtain search directions from decomposed subproblems. We also study how to correct these directions using (decomposable) preconditioned conjugate gradient methods to ensure local convergence in all cases. The choice of appropriate preconditioners results in a natural manner from the structure in the problem. Finally, we conduct computational experiments to compare the resulting procedures with direct methods.Publicad

A decomposition methodology applied to the multiarea optimal power flow problem

The original publication is available at www.springerlink.comThis paper describes a decomposition methodology applied to the multi-area optimal power fiow problem in the context of an electric energy system. The proposed procedure is simple and efficient, and presents sorne advantages with respect to other common decomposition techniques such as Lagrangian relaxation and augmented Lagrangian decomposition. The application to the multi-area optimal power fiow problem allows the computation of an optimal coordinated but decentralized solution. The proposed method is appropriate for an Independent System Operator in charge of the electric energy system technical operation. Convergence properties of the proposed decomposition algorithm are described and related to the physical coupling between the areas. Theoretical and numerical results show that the proposed decentralized methodology has a lower computational cost than other decomposition techniques, and in large large-scale cases even lower than a centralized approach.Research supported by Spanish grants PB98-0728 and BEC 2000-0167. Research partly supported by Ministerio de Ciencia y Tecnología of Spain, project CICYT DPI-2000- 0654.Publicad

A new decomposition method applied to optimization problems arising in power systems: Local and global behavior

In this report a new decomposition methodology for optimization problems is presented. The proposed procedure is general, simple and efficient. It avoids most disadvantages of other common decomposition techniques, such as Lagrangian Relaxation or Augmented Lagrangian Relaxation. The new methodology is applied to a problem coming from interconnected power systems. The application of the new method to this problem allows the computation of an optimal coordinated but decentralized solution. Local and global convergence properties of the proposed decomposition algorithm are described. Numerical results show that the new decentralized methodology has a lower computational cost than other decomposition techniques, and in large-scale cases even lower than a centralized approach